Heuristic search by guided enforced hill climbing in fast forward automated planning
نویسندگان
چکیده
Enforced hill climbing (EHC), a heuristicaa search method, has been frequently used in a number of AI planning systems. This paper presents a new form of EHC, guided enforced hill climbing (GEHC), to enhance EHC efficiency. Main feature in GEHC is an adaptive ordering function. GEHC has shown a significant improvement in EHC efficiency, especially when applied to larger problems.
منابع مشابه
Heuristics and metaheuristics in forward-chaining planning
Forward-chaining heuristic search is a well-established and popular paradigm for planning. It is, however, characterised by two key weaknesses. First, search is guided by a domain-independent heuristic which although applicable in a wide range of domains, can often give poor guidance. Second, the metaheuristics used to control forward-chaining planning are often weak, using simple local-search ...
متن کاملStochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called “basin flooding”). We propose and evaluate a stochastic generalization of enforced hill-climbing for online use in goal-oriented probabilistic planning problems. We assume a provided heuristic function estimating expected cost to the goal with fla...
متن کاملThe FF Planning System : Fast Plan Generation
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be independent. We introduce a novel search strategy that combines hill-climbing with systematic search, and...
متن کاملSearching with Probes: The Classical Planner PROBE
Heuristic search has been the mainstream approach in planning for more than a decade, with planners such as FF, FD, and LAMA being able to solve problems with hundreds of actions and variables in a few seconds (Hoffmann and Nebel 2001; Helmert 2006; Richter and Westphal 2010). The basic idea behind these planners is to search for plans using a search algorithm guided by heuristic estimators der...
متن کاملImproved Integer Programming Models and Heuristic Search for AI Planning
Motivated by the requirements of many real-life applications, recent research in AI planning has shown a growing interest in tackling problems that involve numeric constraints and complex optimization objectives. Applying Integer Programming (IP) to such domains seems to have a significant potential, since it can naturally accommodate their representational requirements. In this paper we explor...
متن کامل